Solving Short Term Multi Chain Hydrothermal Scheduling Problem by Artificial Bee Colony Algorithm

نویسندگان

  • S. M. Abdelmaksoud
  • Ayman Y. Yousef
  • H. A. Henry
چکیده

This paper presents an artificial bee colony algorithm for solving optimal short term hydrothermal scheduling problem. To demonstrate the effectiveness of the proposed algorithm, hydrothermal test system consists of three thermal units and four cascaded hydro power plants has been tested. The valve point loading effect is taken into consideration. In order to show the feasibility and robustness of the proposed algorithm, a wide range of thermal and hydraulic constraints are taken into consideration. The numerical results obtained by ABC algorithm are compared with those obtained from other methods such as genetic algorithm (GA), simulated annealing (SA), evolutionary programming (EP) and constriction factor based particle swarm optimization (CFPSO) technique to reveal the validity and verify the feasibility of the proposed method. The experimental results indicate that the proposed algorithm can obtain better schedule results with minimum execution time when compared to other methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A mathematical model for balancing (cost-time-quality and environmental risks) in oil and gas projects and solving it by multi-objective Bee Colony Algorithm

Today, in large projects such as constructing oil, gas and petrochemical refineries, it is inevitable to use modern management methods and project timing. On the other hand, in classic scheduling case, the focus is on balance between time and cost of carrying out projects, which in such a situation, one of possible solutions to shorten time of implementing project is to accelerate activities. T...

متن کامل

Modelling and Scheduling Lot Streaming Flexible Flow Lines

Although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. This paper deals with scheduling jobs in lot streaming flexible flow line problems. The paper mathematically formulates the problem by a mixed integer linear programming model. This model solves small instances to optimality. Moreo...

متن کامل

An efficient job shop scheduling algorithm based on artificial bee colony

The job shop scheduling problem (JSSP) is an NP-hard problem of wide engineering and theoretical background. In this paper, a discrete artificial bee colony based memetic algorithm, named DABC, is proposed for solving JSSP. Firstly, to make artificial bee colony (ABC) suitable for solving JSSP, we present a food source as a discrete job permutation and use the discrete operation to generate a n...

متن کامل

An Efficient Modified Artificial Bee Colony Algorithm for Job Scheduling Problem

Swarm intelligence systems are typically made up of a population of simple agents or boids interacting locally with one another and with their environment. Particle swarm, Ant colony, Bee colony are examples of swarm intelligence. In the field of computer science and operations research, Artificial Bee Colony Algorithm (ABC) is an optimization algorithm based on the intelligent foraging behavio...

متن کامل

A Hybrid Artificial Bee Colony Algorithm for Flexible Job Shop Scheduling Problems

In this paper, we propose a hybrid Pareto-based artificial bee colony (HABC) algorithm for solving the multi-objective flexible job shop scheduling problem. In the hybrid algorithm, each food sources is represented by two vectors, i.e., the machine assignment vector and the operation scheduling vector. The artificial bee is divided into three groups, namely, employed bees, onlookers, and scouts...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015